Using injection points in reformulation local search for solving continuous location problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Search Heuristics for Facility Location Problems

In this thesis, we develop approximation algorithms for facility location problems based on local search techniques. Facility location is an important problem in operations research. Heuristic approaches have been used to solve many variants of the problem since the 1960s. The study of approximation algorithms for facility location problems started with the work of Hochbaum. Although local sear...

متن کامل

Solving Partial Constraint Satisfaction Problems using Local Search and Abstraction

Partial constraint satisfaction problems PCSPs were proposed by Freuder and Wallace to address some of the representational di culties with traditional constraint satisfaction techniques However the reasoning method of their proposal was limited to traditional backtracking based algorithms In this paper we extend the PCSP model by associating it with a local search algorithm which has found gre...

متن کامل

Solving Over-Constrained Temporal Reasoning Problems Using Local Search

Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a knowledge-base consisting of temporal relations, the main reasoning problem is to determine whether the knowledge-base is satisfiable, i.e., is there a scenario which is consistent with the information provided. However,...

متن کامل

Guided Local Search for Query Reformulation Using Weight Propagation

A new technique for query reformulation that assesses the relevance of retrieved documents using weight propagation is proposed. The technique uses a Guided Local Search (GLS) in conjunction with the latent semantic indexing model (to semantically cluster documents together) and Lexical Matching (LM). The GLS algorithm is used to construct a minimum spanning tree that is later employed in the r...

متن کامل

Solving Complex Optimization Problems by Local Search

Ter herinnering aan mijn vader Contents 1 1 Introduction Based on the rapid technical progress in the last decades the automation in many areas of production and distribution has grown drastically. This development leads more and more to situations where decisions between several alternatives have to be taken within short time – often without the interaction of human beings. However, not only t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: YUJOR

سال: 2017

ISSN: 0354-0243,1820-743X

DOI: 10.2298/yjor160517018b